Dynamic random Weyl sampling for drastic reduction of randomness in Monte Carlo integration
نویسنده
چکیده
To reduce randomness drastically in Monte Carlo (MC) integration, we propose a pairwise independent sampling, the dynamic random Weyl sampling (DRWS). DRWS is applicable even if the length of random bits to generate a sample may vary. The algorithm of DRWS is so simple that it works very fast, even though the pseudo-random generator, the source of randomness, might be slow. In particular, we can use a cryptographically secure pseudo-random generator for DRWS to obtain the most reliable numerical integration method for complicated functions. © 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.
منابع مشابه
Monte Carlo and quasi-Monte Carlo methods
Monte Carlo is one of the most versatile and widely used numerical methods. Its convergence rate, O(N~^), is independent of dimension, which shows Monte Carlo to be very robust but also slow. This article presents an introduction to Monte Carlo methods for integration problems, including convergence theory, sampling methods and variance reduction techniques. Accelerated convergence for Monte Ca...
متن کاملImportance Sampled Learning Ensembles
Learning a function of many arguments is viewed from the perspective of high– dimensional numerical quadrature. It is shown that many of the popular ensemble learning procedures can be cast in this framework. In particular randomized methods, including bagging and random forests, are seen to correspond to random Monte Carlo integration methods each based on particular importance sampling strate...
متن کاملApplication of Monte Carlo Simulation in the Assessment of European Call Options
In this paper, the pricing of a European call option on the underlying asset is performed by using a Monte Carlo method, one of the powerful simulation methods, where the price development of the asset is simulated and value of the claim is computed in terms of an expected value. The proposed approach, applied in Monte Carlo simulation, is based on the Black-Scholes equation which generally def...
متن کاملVariance reduction in sample approximations of stochastic programs
This paper studies the use of randomized Quasi-Monte Carlo methods (RQMC) in sample approximations of stochastic programs. In high dimensional numerical integration, RQMC methods often substantially reduce the variance of sample approximations compared to MC. It seems thus natural to use RQMC methods in sample approximations of stochastic programs. It is shown, that RQMC methods produce epi-con...
متن کاملOn the Sampling Problem for Kernel Quadrature
The standard Kernel Quadrature method for numerical integration with random point sets (also called Bayesian Monte Carlo) is known to converge in root mean square error at a rate determined by the ratio s/d, where s and d encode the smoothness and dimension of the integrand. However, an empirical investigation reveals that the rate constant C is highly sensitive to the distribution of the rando...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematics and Computers in Simulation
دوره 62 شماره
صفحات -
تاریخ انتشار 2003